The Log Space Oracle Hierarchy Collapses DRAFT
نویسندگان
چکیده
The polynomial time hierarchy of Meyer and Stockmeyer has several equivalent characterizations — in particular it can be defined either in terms of polynomial time oracle Turing machines [Sto76], or in terms of polynomial time alternating Turing machines where the number of alternations is finitely bounded [CKS81]. One of the most important open questions in the area is whether or not this hierarchy collapses. (It collapses to P iff P = NP .) Similar hierarchies based on space bounded computations have been investigated by Ruzzo, Simon and Tompa [RST84]. They introduced a well-behaved model of space-bounded oracle Turing machine, and showed that the entire log space alternation hierarchy was contained in the second level of the log space oracle hierarchy. Subsequently Lange, Jenner and Kirsig [LJK87] proved that the alternation hierarchy collapsed to its second level; this suggested the possibility that the log space oracle hierarchy might not coincide with the log space alternation hierarchy. In this paper we show that the log space oracle hierarchy also collapses, that it thus does coincide with the log space alternation hierarchy, and that the resulting complexity class L has other interesting characterizations in terms of circuits with oracle gates. A crucial aspect of these results is the exact definition of log space and nondeterministic log space oracle machines. We follow [RST84] which contains a discussion of the issues involved. In their model the oracle tape is
منابع مشابه
Downward separation fails catastrophically for limited nondeterminism classes
The hierarchy consists of sets k = NPPlog k n] NP. Unlike collapses in the polynomial hierarchy and the Boolean hierarchy, collapses in the hierarchy do not seem to translate up, nor does closure under complement seem to cause the hierarchy to collapse. For any consistent set of collapses and separations of levels of the hierarchy that respects P = 1 2 NP, we can construct an oracle relative to...
متن کاملCounting Classes and the Fine Structure between NC1 and L
The class NC of problems solvable by bounded fan-in circuit families of logarithmic depth is known to be contained in logarithmic space L, but not much about the converse is known. In this paper we examine the structure of classes in between NC and L based on counting functions or, equivalently, based on arithmetic circuits. The classes PNC and C=NC, defined by a test for positivity and a test ...
متن کاملA Hierarchy Based on Output Multiplicity
The class NPkV consists of those partial, multivalued functions that can be computed by a nondeterministic, polynomial time-bounded transducer that has at most k distinct values on any input. We define the output-multiplicity hierarchy to consist of the collection of classes NPkV, for all positive integers k 1. In this paper we investigate the strictness of the output-multiplicity hierarchy and...
متن کاملMultifunction algebras and the provability of PH
We introduce multifunction algebras Bτ i where τ is a set of 0 or 1-ary terms used to bound recursion lengths. We show that if for all ` ∈ τ we have ` ∈ O(|x|) then Bτ i = FP p i−1(wit, τ̇), those multifunctions computable in polynomial time with at most O(p(`(x))) queries to a Σpi−1 witness oracle for ` ∈ τ and p a polynomial. We use our algebras to obtain independence results in bounded arithm...
متن کاملConsequences of the provability of NP ⊆ P/poly
We prove the following results: (i) PV proves NP ⊆ P/poly iff PV proves coNP ⊆ NP/O(1). (ii) If PV proves NP ⊆ P/poly then PV proves that the Polynomial Hierarchy collapses to the Boolean Hierarchy. (iii) S2 proves NP ⊆ P/poly iff S 1 2 proves coNP ⊆ NP/O(log n). (iv) If S2 proves NP ⊆ P/poly then S 1 2 proves that the Polynomial Hierarchy collapses to P[log n]. (v) If S2 proves NP ⊆ P/poly the...
متن کامل